Formal Language Characterization of Cellular Automaton Limit Sets
نویسنده
چکیده
A formal language description of one-d imensional cellu lar automata limit sets is given, and a series of examples illustrating several degrees of complexity are constructed. The undecidability of membership of a string in the limit set of a cellu lar automaton ru le is proven.
منابع مشابه
Formal Languages and Finite Cellular Automata
A bst ract. A one-dimensional cellular automaton rule with specified boundary conditions can be considered as acting simultaneously on all finite lattices, which gives a mapping between formal languages. Regular lang uages are always mapped to regular langu ages, contex t-free to context-free, context-sensitive to context-sensitive, and recursive sets to recursive sets . In particular, the fini...
متن کاملConstruction of μ-Limit Sets of Two-Dimensional Cellular Automata
We prove a characterization of μ-limit sets of two-dimensional cellular automata, extending existing results in the one-dimensional case. This sets describe the typical asymptotic behaviour of the cellular automaton, getting rid of exceptional cases, when starting from the uniform measure.
متن کاملOn the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
We study the notion of limit sets of cellular automata associated with probability measures (μ-limit sets). This notion was introduced by P. Kůrka and A. Maass in [1]. It is a refinement of the classical notion of ω-limit sets dealing with the typical long term behavior of cellular automata. It focuses on the words whose probability of appearance does not tend to 0 as time tends to infinity (th...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملWhat subshifts are the limit set of a cellular automaton?
Cellular automata are the most natural discretization of dynamical systems. Their long-term behaviour is captured in their limit set, also known as the maximal attractor. We investigate what complexity limit sets can have from the point of view of language theory, and we try to give some dynamical characterizations of subshifts that are limit sets. Then, the inverse problem of determining the l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Complex Systems
دوره 1 شماره
صفحات -
تاریخ انتشار 1987